N-gram Pattern Matching and Dynamic Programming for Symbolic Melody Search

For this submission to MIREX 2007, we again provide a simple base-line for comparison against other algorithms for the task of symbolic melody matching against both monophonic and polyphonic collections of music. This year, we have included the n-gram-based matching technique that is implemented by building an n-gram index of the query, which is then used to search through each melody or track within the collection. In addition we provide the two dynamic programming algorithms submitted to MIREX 2006 for the same tasks. All three algorithms were statistically indistinguishable from the other algorithms submitted for the task, and were two orders of magnitude faster.